0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.11	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.32	% Computer : n023.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1920
0.11/0.32	% WCLimit    : 240
0.11/0.32	% DateTime   : Wed Jul 30 09:18:19 EDT 2025
0.11/0.32	% CPUTime    : 
0.18/0.45	Running higher-order theorem proving
0.18/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p
1.25/0.66	# Version: 3.0.0-ho
1.25/0.66	# Preprocessing class: HSLMSMSMLLLCHSA.
1.25/0.66	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
1.25/0.66	# Starting pre_casc_4 with 960s (4) cores
1.25/0.66	# Starting full_lambda_6 with 240s (1) cores
1.25/0.66	# Starting sh10 with 240s (1) cores
1.25/0.66	# Starting post_as_ho9 with 240s (1) cores
1.25/0.66	# Starting post_as_ho8 with 240s (1) cores
1.25/0.66	# pre_casc_4 with pid 429 completed with status 0
1.25/0.66	# Result found by pre_casc_4
1.25/0.66	# Preprocessing class: HSLMSMSMLLLCHSA.
1.25/0.66	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
1.25/0.66	# Starting pre_casc_4 with 960s (4) cores
1.25/0.66	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
1.25/0.66	# Search class: HGUSM-FSLM31-DHSMMFBN
1.25/0.66	# partial match(2): HGUSM-FSLM31-DHSFFFBN
1.25/0.66	# Scheduled 6 strats onto 4 cores with 960 seconds (960 total)
1.25/0.66	# Starting new_bool_5 with 432s (1) cores
1.25/0.66	# Starting pre_casc_4 with 97s (1) cores
1.25/0.66	# Starting ehoh_best8_lambda with 108s (1) cores
1.25/0.66	# Starting new_bool_1 with 108s (1) cores
1.25/0.66	# pre_casc_4 with pid 436 completed with status 0
1.25/0.66	# Result found by pre_casc_4
1.25/0.66	# Preprocessing class: HSLMSMSMLLLCHSA.
1.25/0.66	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
1.25/0.66	# Starting pre_casc_4 with 960s (4) cores
1.25/0.66	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
1.25/0.66	# Search class: HGUSM-FSLM31-DHSMMFBN
1.25/0.66	# partial match(2): HGUSM-FSLM31-DHSFFFBN
1.25/0.66	# Scheduled 6 strats onto 4 cores with 960 seconds (960 total)
1.25/0.66	# Starting new_bool_5 with 432s (1) cores
1.25/0.66	# Starting pre_casc_4 with 97s (1) cores
1.25/0.66	# Preprocessing time       : 0.005 s
1.25/0.66	# Presaturation interreduction done
1.25/0.66	
1.25/0.66	# Proof found!
1.25/0.66	# SZS status Theorem
1.25/0.66	# SZS output start CNFRefutation
1.25/0.66	thf(decl_23, type, is_of: $i > ($i > $o) > $o).
1.25/0.66	thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o).
1.25/0.66	thf(decl_26, type, in: $i > $i > $o).
1.25/0.66	thf(decl_73, type, l_some: $i > ($i > $o) > $o).
1.25/0.66	thf(decl_78, type, e_is: $i > $i > $i > $o).
1.25/0.66	thf(decl_124, type, nat: $i).
1.25/0.66	thf(decl_125, type, n_is: $i > $i > $o).
1.25/0.66	thf(decl_128, type, n_some: ($i > $o) > $o).
1.25/0.66	thf(decl_143, type, n_pl: $i > $i > $i).
1.25/0.66	thf(decl_148, type, diffprop: $i > $i > $i > $o).
1.25/0.66	thf(decl_149, type, d_29_ii: $i > $i > $o).
1.25/0.66	thf(decl_150, type, iii: $i > $i > $o).
1.25/0.66	thf(decl_163, type, n_ts: $i > $i > $i).
1.25/0.66	thf(decl_190, type, frac: $i).
1.25/0.66	thf(decl_192, type, num: $i > $i).
1.25/0.66	thf(decl_193, type, den: $i > $i).
1.25/0.66	thf(decl_195, type, moref: $i > $i > $o).
1.25/0.66	thf(decl_196, type, lessf: $i > $i > $o).
1.25/0.66	thf(decl_199, type, n_pf: $i > $i > $i).
1.25/0.66	thf(decl_201, type, esk1_0: $i).
1.25/0.66	thf(decl_202, type, esk2_0: $i).
1.25/0.66	thf(decl_203, type, esk3_0: $i).
1.25/0.66	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_diffprop)).
1.25/0.66	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_d_29_ii)).
1.25/0.66	thf(def_n_is, axiom, ((n_is)=(e_is @ nat)), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_n_is)).
1.25/0.66	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_iii)).
1.25/0.66	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_all_of)).
1.25/0.66	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_is_of)).
1.25/0.66	thf(def_moref, axiom, ((moref)=(^[X1:$i, X219:$i]:((d_29_ii @ (n_ts @ (num @ X1) @ (den @ X219)) @ (n_ts @ (num @ X219) @ (den @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_moref)).
1.25/0.66	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_n_some)).
1.25/0.66	thf(def_lessf, axiom, ((lessf)=(^[X1:$i, X220:$i]:((iii @ (n_ts @ (num @ X1) @ (den @ X220)) @ (n_ts @ (num @ X220) @ (den @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', def_lessf)).
1.25/0.66	thf(satz63a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X518:$i]:((in @ X518 @ frac))) @ (^[X519:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:(((moref @ X1 @ X519)<=(moref @ (n_pf @ X1 @ X4) @ (n_pf @ X519 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', satz63a)).
1.25/0.66	thf(satz63c, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X536:$i]:((in @ X536 @ frac))) @ (^[X537:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:(((lessf @ X1 @ X537)<=(lessf @ (n_pf @ X1 @ X4) @ (n_pf @ X537 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.wwXBY0fKbP/E---3.1_349.p', satz63c)).
1.25/0.66	thf(c_0_11, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
1.25/0.66	thf(c_0_12, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2)))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
1.25/0.66	thf(c_0_13, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2))))), inference(apply_def,[status(thm)],[c_0_11, def_n_is])).
1.25/0.66	thf(c_0_14, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z1 @ (n_pl @ Z0 @ Z2)))))))), inference(fof_simplification,[status(thm)],[def_iii])).
1.25/0.66	thf(c_0_15, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
1.25/0.66	thf(c_0_16, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
1.25/0.66	thf(c_0_17, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_moref])).
1.25/0.66	thf(c_0_18, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_13]), def_n_some])).
1.25/0.66	thf(c_0_19, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_pl @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_lessf])).
1.25/0.66	thf(c_0_20, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z1 @ (n_pl @ Z0 @ Z2)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_13]), def_n_some])).
1.25/0.66	thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_15, c_0_16])).
1.25/0.66	thf(c_0_22, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2))))))))), inference(apply_def,[status(thm)],[c_0_17, c_0_18])).
1.25/0.66	thf(c_0_23, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_pl @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ Z2))))))))), inference(apply_def,[status(thm)],[c_0_19, c_0_20])).
1.25/0.66	thf(c_0_24, plain, ![X644:$i]:(((in @ X644 @ frac)=>![X643:$i]:(((in @ X643 @ frac)=>![X642:$i]:(((in @ X642 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X644 @ X642)) @ (den @ (n_pf @ X643 @ X642))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X643 @ X642)) @ (den @ (n_pf @ X644 @ X642))) @ Z0)))))=>(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X644) @ (den @ X643)) @ (n_pl @ (n_ts @ (num @ X643) @ (den @ X644)) @ Z0)))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz63a]), c_0_21]), c_0_22])])).
1.25/0.66	thf(c_0_25, negated_conjecture, ~(![X587:$i]:(((in @ X587 @ frac)=>![X586:$i]:(((in @ X586 @ frac)=>![X585:$i]:(((in @ X585 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X586 @ X585)) @ (den @ (n_pf @ X587 @ X585))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X587 @ X585)) @ (den @ (n_pf @ X586 @ X585))) @ Z0)))))=>(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X586) @ (den @ X587)) @ (n_pl @ (n_ts @ (num @ X587) @ (den @ X586)) @ Z0))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz63c])]), c_0_21]), c_0_23])])).
1.25/0.66	thf(c_0_26, plain, ![X934:$i, X935:$i, X936:$i]:((~(in @ X934 @ frac)|(~(in @ X935 @ frac)|(~(in @ X936 @ frac)|(~(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X934 @ X936)) @ (den @ (n_pf @ X935 @ X936))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X935 @ X936)) @ (den @ (n_pf @ X934 @ X936))) @ Z0)))))|(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X934) @ (den @ X935)) @ (n_pl @ (n_ts @ (num @ X935) @ (den @ X934)) @ Z0)))))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])).
1.25/0.66	thf(c_0_27, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&((in @ esk3_0 @ frac)&((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ esk2_0 @ esk3_0)) @ (den @ (n_pf @ esk1_0 @ esk3_0))) @ (n_pl @ (n_ts @ (num @ (n_pf @ esk1_0 @ esk3_0)) @ (den @ (n_pf @ esk2_0 @ esk3_0))) @ Z0)))))&~(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_pl @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ Z0))))))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])).
1.25/0.66	thf(c_0_28, plain, ![X1:$i, X4:$i, X5:$i]:(((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_pl @ (n_ts @ (num @ X4) @ (den @ X1)) @ Z0)))))|~((in @ X1 @ frac))|~((in @ X4 @ frac))|~((in @ X5 @ frac))|~((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X1 @ X5)) @ (den @ (n_pf @ X4 @ X5))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X4 @ X5)) @ (den @ (n_pf @ X1 @ X5))) @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_26])).
1.25/0.66	thf(c_0_29, negated_conjecture, (l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ esk2_0 @ esk3_0)) @ (den @ (n_pf @ esk1_0 @ esk3_0))) @ (n_pl @ (n_ts @ (num @ (n_pf @ esk1_0 @ esk3_0)) @ (den @ (n_pf @ esk2_0 @ esk3_0))) @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_27])).
1.25/0.66	thf(c_0_30, negated_conjecture, (in @ esk3_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])).
1.25/0.66	thf(c_0_31, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])).
1.25/0.66	thf(c_0_32, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])).
1.25/0.66	thf(c_0_33, negated_conjecture, ~((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_pl @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_27])).
1.25/0.66	thf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31]), c_0_32])]), c_0_33]), ['proof']).
1.25/0.66	# SZS output end CNFRefutation
1.25/0.66	# Parsed axioms                        : 594
1.25/0.66	# Removed by relevancy pruning/SinE    : 445
1.25/0.66	# Initial clauses                      : 157
1.25/0.66	# Removed in clause preprocessing      : 4
1.25/0.66	# Initial clauses in saturation        : 153
1.25/0.66	# Processed clauses                    : 361
1.25/0.66	# ...of these trivial                  : 3
1.25/0.66	# ...subsumed                          : 39
1.25/0.66	# ...remaining for further processing  : 319
1.25/0.66	# Other redundant clauses eliminated   : 14
1.25/0.66	# Clauses deleted for lack of memory   : 0
1.25/0.66	# Backward-subsumed                    : 0
1.25/0.66	# Backward-rewritten                   : 6
1.25/0.66	# Generated clauses                    : 1559
1.25/0.66	# ...of the previous two non-redundant : 1498
1.25/0.66	# ...aggressively subsumed             : 0
1.25/0.66	# Contextual simplify-reflections      : 0
1.25/0.66	# Paramodulations                      : 427
1.25/0.66	# Factorizations                       : 0
1.25/0.66	# NegExts                              : 5
1.25/0.66	# Equation resolutions                 : 15
1.25/0.66	# Disequality decompositions           : 0
1.25/0.66	# Total rewrite steps                  : 219
1.25/0.66	# ...of those cached                   : 175
1.25/0.66	# Propositional unsat checks           : 0
1.25/0.66	#    Propositional check models        : 0
1.25/0.66	#    Propositional check unsatisfiable : 0
1.25/0.66	#    Propositional clauses             : 0
1.25/0.66	#    Propositional clauses after purity: 0
1.25/0.66	#    Propositional unsat core size     : 0
1.25/0.66	#    Propositional preprocessing time  : 0.000
1.25/0.66	#    Propositional encoding time       : 0.000
1.25/0.66	#    Propositional solver time         : 0.000
1.25/0.66	#    Success case prop preproc time    : 0.000
1.25/0.66	#    Success case prop encoding time   : 0.000
1.25/0.66	#    Success case prop solver time     : 0.000
1.25/0.66	# Current number of processed clauses  : 173
1.25/0.66	#    Positive orientable unit clauses  : 50
1.25/0.66	#    Positive unorientable unit clauses: 0
1.25/0.66	#    Negative unit clauses             : 7
1.25/0.66	#    Non-unit-clauses                  : 116
1.25/0.66	# Current number of unprocessed clauses: 1361
1.25/0.66	# ...number of literals in the above   : 11763
1.25/0.66	# Current number of archived formulas  : 0
1.25/0.66	# Current number of archived clauses   : 146
1.25/0.66	# Clause-clause subsumption calls (NU) : 16360
1.25/0.66	# Rec. Clause-clause subsumption calls : 3101
1.25/0.66	# Non-unit clause-clause subsumptions  : 32
1.25/0.66	# Unit Clause-clause subsumption calls : 120
1.25/0.66	# Rewrite failures with RHS unbound    : 0
1.25/0.66	# BW rewrite match attempts            : 23
1.25/0.66	# BW rewrite match successes           : 6
1.25/0.66	# Condensation attempts                : 0
1.25/0.66	# Condensation successes               : 0
1.25/0.66	# Termbank termtop insertions          : 103268
1.25/0.66	# Search garbage collected termcells   : 19574
1.25/0.66	
1.25/0.66	# -------------------------------------------------
1.25/0.66	# User time                : 0.105 s
1.25/0.66	# System time              : 0.017 s
1.25/0.66	# Total time               : 0.122 s
1.25/0.66	# Maximum resident set size: 5872 pages
1.25/0.66	
1.25/0.66	# -------------------------------------------------
1.25/0.66	# User time                : 0.357 s
1.25/0.66	# System time              : 0.037 s
1.25/0.66	# Total time               : 0.394 s
1.25/0.66	# Maximum resident set size: 2844 pages
1.25/0.66	% E exiting
1.25/0.66	% E exiting
1.25/0.66	EOF